Distributed Anomaly Detection using Satellite Data From Multiple Modalitie.

A local asynchronous distributed privacy preserving feature selection algorithm for large peer%2Dto%2Dpeer networks.

%3F%2DAnomica A Fast Support Vector Based Novelty Detection Technique.



A Local Distributed Peer%2Dto%2DPeer Algorithm Using Multi%2DParty Optimization Based Privacy Preservation for Data Mining Primitive Computation.

Scalable Distributed Change Detection from Astronomy Data Streams Using Local
Electrical Engineering Surface curvature is used in a number of areas in computer graphics including mesh simplification, surface modeling and denoising, feature detection, and non-photorealistic line drawing techniques. Most applications must estimate surface curvature, due to the use of discrete models such as triangular meshes. Until recently, curvature estimation has been limited to CPU algorithms, forcing object geometry to reside in main memory. More computational work is being done directly on the GPU, and it is increasingly common for object geometry to


An Efficient Local Algorithm for Distributed Multivariate Regression in Peer%2Dto%2DPeer Networks.
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compaction, data modeling and classification tasks in many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Computing a global regression model from data available at the different peer-nodes using a traditional centralized algorithm for regression can be very costly and impractical because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. This paper proposes a two-step approach to deal with this problem. First, it offers an efficient local distributed algorithm that monitors the “quality ” of the current regression model. If the model is outdated, it uses this algorithm as a feedback mechanism for rebuilding the model. The local nature of the monitoring algorithm guarantees low monitoring cost. Experimental results presented in this paper strongly support the theoretical claims. 1
Distributed Identification of Top%2Dl Inner Product Elements and its Application in a Peer%2Dto%2DPeer Network.
Abstract — Inner product measures how closely two feature vectors are related. It is an important primitive for many popular data mining tasks, e.g., clustering, classification, correlation computation, and decision tree construction. If the entire data set is available at a single site, then computing the inner product matrix and identifying the top (in terms of magnitude) entries is trivial. However, in many real-world scenarios, data is distributed across many locations and transmitting the data to a central server would be quite communication-intensive and not scalable. This paper presents an approximate local algorithm for identifying top-l inner products among pairs of feature vectors in a large asynchronous distributed environment such as a peer-to-peer (P2P) network. We develop a probabilistic algorithm for this purpose using order statistics and Hoeffding bound. We present experimental results to show the effectiveness and scalability of the algorithm. Finally, we demonstrate an application of this technique for interest-based community formation in a P2P environment. Index Terms — distributed data mining, inner product, peer-topeer network I.
Distributed Decision%2DTree Induction in Peer%2Dto%2DPeer Systems.
This paper offers a scalable and robust distributed algorithm for decision tree induction in large Peer-to-Peer (P2P) environments. Computing a decision tree in such large distributed systems using standard centralized algorithms can be very communication-expensive and impractical because of the synchronization requirements. The problem becomes even more challenging in the distributed stream monitoring scenario where the decision tree needs to be updated in response to changes in the data distribution. This paper presents an alternate solution that works in a completely asynchronous manner in distributed environments and offers low communication overhead, a necessity for scalability. It also seamlessly handles changes in data and peer failures. The paper presents extensive experimental results to corroborate the theoretical claims. Index Terms peer-to-peer, data mining, decision trees I.
Peer%2Dto%2DPeer Data Mining%2C Privacy Issues%2C and Games.

Local L2%2DThresholding Based Data Mining in Peer%2Dto%2DPeer Systems.
In a large network of computers, wireless sensors, or mobile devices, each of the components (hence, peers) has some data about the global status of the system. Many of the functions of the system, such as routing decisions, search strategies, data cleansing, and the assignment of mutual trust, depend on the global status. Therefore, it is essential that the system be able to detect, and react to, changes in its global status. Computing global predicates in such systems is usually very costly. Mainly because of their scale, and in some cases (e.g., sensor networks) also because of the high cost of communication. The cost further increases when the data changes rapidly (due to state changes, node failure, etc.) and computation has to follow these changes. In this paper we describe a two step approach for dealing with these costs. First, we describe a highly efficient local algorithm which detect when the L2 norm of the average data surpasses a threshold. Then, we use this algorithm as a feedback loop for the monitoring of complex predicates on the data – such as the data’s k-means clustering. The efficiency of the L2 algorithm guarantees that so long as the clustering results represent the data (i.e., the data is stationary) few resources are required. When the data undergoes an epoch change – a change in the underlying distribution – and the model no longer represents it, the feedback loop indicates this and the model is rebuilt. Furthermore, the existence of a feedback loop allows using approximate and “best-effort ” methods for constructing the model; if an ill-fit model is built the feedback loop would indicate so, and the model would be rebuilt. 1
Distributed Data Mining in Peer%2Dto%2DPeer Networks.
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer (P2P) computing is emerging as a new distributed computing paradigm for many novel applications that involve exchange of information among a large number of peers with little centralized coordination. P2P file sharing, P2P electronic commerce, and P2P monitoring based on a network of sensors are some examples. This paper offers an overview of distributed data mining applications and algorithms for P2P environments. It describes both exact and approximate distributed data mining algorithms that work in a decentralized manner.
Client%2Dside web mining for community formation in peer%2Dto%2Dpeer environments.
In this paper we present a framework for self-formation of interests-based Peer-to-Peer communities using client-side web browsing history. We propose an order statistics-based algorithm to build communities with hierarchical structures. We also carefully consider the privacy concerns of the peer and adopt cryptographic protocols to measure similarity between peers without disclosing their personal profiles. We have evaluated our algorithm using a distributed data mining toolkit. The experimental results show that our framework could efficiently build interests-based communities.
